Irregularity Strength of Regular Graphs

نویسنده

  • Jakub Przybylo
چکیده

Let G be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer w, a w-weighting of G is a map f : E(G) → {1, 2, . . . , w}. An irregularity strength of G, s(G), is the smallest w such that there is a w-weighting of G for which ∑

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

متن کامل

Total vertex irregularity strength of corona product of some graphs

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

متن کامل

On the irregularity strength of trees

For any graph G, let ni be the number of vertices of degree i, and λ(G) = maxi≤j{ ni+···+nj+i−1 j }. This is a general lower bound on the irregularity strength of graph G. All known facts suggest that for connected graphs, this is the actual irregularity strength up to an additive constant. In fact, this was conjectured to be the truth for regular graphs and for trees. Here we find an infinite ...

متن کامل

Non-regular graphs with minimal total irregularity

The total irregularity of a simple undirected graphG is defined as irrt(G) = 1 2 ∑ u,v∈V (G) |dG(u)− dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). Obviously, irrt(G) = 0 if and only if G is regular. Here, we characterize the non-regular graphs with minimal total irregularity and thereby resolve the recent conjecture by Zhu, You and Yang [18] about the lower bound on the minimal ...

متن کامل

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2008